Steiner Trades That Give Rise to Completely Decomposable Latin Interchanges
نویسندگان
چکیده
In this paper we focus on the representation of Steiner trades of volume less than or equal to nine and identify those for which the associated partial latin square can be decomposed into six disjoint latin interchanges. 1 Background information In any combinatorial configuration it is possible to identify a subset which uniquely determines the structure of the configuration and in some cases is minimal with respect to this property. For example such subsets can be found by studying the literature on critical sets in latin squares (see Donovan and Howse [2]) and defining sets in block designs (see Street [7]), as well as in the study of premature partial latin squares (see Brankovic, Horak, Miller and Rosa [1]). Research has shown that computer analysis of critical sets, defining sets and premature partial latin squares is computationally expensive. This fact has led to a study of the inherent nature of the configuration in order to obtain information for refining searches and associated algorithms. In the past, critical sets, defining sets and premature partial latin squares have been studied in isolation and, in many cases, using different techniques. However, there is much to be gained by studying these configurations in unison. A crucial element in the identification of defining sets or critical sets is the determination of interchangeable elements within the design or latin square. By representing the interchangeable sets in certain designs as associated partial latin squares, Donovan, Khodkar and Street [3], [4] have identified new families of defining sets. The work in the papers [3], [4] raises many new questions. For instance, can our knowledge of the interchangeable sets in latin squares (latin interchanges) be used to classify the interchangeable sets in the block designs (trades)? It is this interesting question that we focus on here. In Section 2 of this paper we give the appropriate definitions of (partial) latin squares and latin interchanges, (partial) Steiner triple systems and associated Steiner trades, and finally detail the connection between latin interchanges and Steiner trades. In Section 3 we take all Steiner trades of volume less than or equal to nine and classify them according to the structure of the associated latin interchanges. 2 Richard Bean et al.
منابع مشابه
On the possible volume of $mu$-$(v,k,t)$ trades
A $mu$-way $(v,k,t)$ $trade$ of volume $m$ consists of $mu$ disjoint collections $T_1$, $T_2, dots T_{mu}$, each of $m$ blocks, such that for every $t$-subset of $v$-set $V$ the number of blocks containing this t-subset is the same in each $T_i (1leq i leq mu)$. In other words any pair of collections ${T_i,T_j}$, $1leq i< j leq mu$ is a $(v,k,t)$ trade of volume $m$. In th...
متن کاملTo the theory of q-ary Steiner and other-type trades
We introduce the concept of a clique bitrade, which generalizes several known types of bitrades, including latin bitrades, Steiner T(k−1, k, v) bitrades, extended 1perfect bitrades. For a distance-regular graph, we show a one-to-one correspondence between the clique bitrades that meet the weight-distribution lower bound on the cardinality and the bipartite isometric subgraphs that are distance-...
متن کاملCycle Switches in Latin Squares
Cycle switches are the simplest changes which can be used to alter latin squares, and as such have found many applications in the generation of latin squares. They also provide the simplest examples of latin interchanges or trades in latin square designs. In this paper we construct graphs in which the vertices are classes of latin squares. Edges arise from switching cycles to move from one clas...
متن کاملComputable Completely Decomposable Groups
A completely decomposable group is an abelian group of the form ⊕ i Hi, where Hi ≤ (Q,+). We show that every computable completely decomposable group is ∆5-categorical. We construct a computable completely decomposable group which is not ∆4-categorical, and give an example of a computable completely decomposable group G which is ∆4-categorical but not ∆3-categorical. We also prove that the inde...
متن کاملOn 2-(v, 3) trades of minimum volume
In this paper, Steiner and non-Steiner 2-(v, 3) trades of minimum volume are considered. It is shown that these trades are composed of a union of some Pasch configurations and possibly some 2-(v, 3) trades with 6 ≤ v ≤ 10. We determine the number of non-isomorphic Steiner 2-(v, 3) trades of minimum volume. As for non-Steiner trades the same thing is done for all vs, except for v ≡ 5 (mod 6).
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Int. J. Comput. Math.
دوره 79 شماره
صفحات -
تاریخ انتشار 2002